MATHEMATICAL ENGINEERING TECHNICAL REPORTS Discrete Hessian Matrix for L-convex Functions
نویسندگان
چکیده
L-convex functions are nonlinear discrete functions on integer points that are computationally tractable in optimization. In this paper, a discrete Hessian matrix and a local quadratic expansion are defined for L-convex functions. We characterize L-convex functions in terms of the discrete Hessian matrix and the local quadratic expansion.
منابع مشابه
On Discrete Hessian Matrix and Convex Extensibility
For functions defined on integer lattice points, discrete versions of the Hessian matrix have been considered in various contexts. In discrete convex analysis, for example, certain combinatorial properties of the discrete Hessian matrices are known to characterize M-convex and L-convex functions, which can be extended to convex functions in real variables. The relationship between convex extens...
متن کاملA class of multi-agent discrete hybrid non linearizable systems: Optimal controller design based on quasi-Newton algorithm for a class of sign-undefinite hessian cost functions
In the present paper, a class of hybrid, nonlinear and non linearizable dynamic systems is considered. The noted dynamic system is generalized to a multi-agent configuration. The interaction of agents is presented based on graph theory and finally, an interaction tensor defines the multi-agent system in leader-follower consensus in order to design a desirable controller for the noted system. A...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Note on Multimodularity and L-Convexity
Multimodular functions and L-convex functions have been investigated almost independently, but they are, in fact, equivalent objects that can be related through a simple coordinate transformation. Some facts known for L-convex functions can be translated to new results for multimodular functions, and vice versa. In particular, the local optimality condition for global optimality found in the li...
متن کاملContinuous Discrete Variable Optimization of Structures Using Approximation Methods
Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Discrete L-/M-Convex Function Minimization Based on Continuous Relaxation
We consider the problem of minimizing a nonlinear discrete function with L-/M-convexity proposed in the theory of discrete convex analysis. For this problem, steepest descent algorithms and steepest descent scaling algorithms are known. In this paper, we use continuous relaxation approach which minimizes the continuous variable version first in order to find a good initial solution of a steepes...
متن کامل